public class Test {
    public static void main(String[] args) {
        //由⼆叉树的前序来构建及遍历。
        BinaryTree binaryTree = new BinaryTree();
        String s = "abc##de#g##f###";
        BinaryTree.TreeNode root = binaryTree.createTree1(s);
        binaryTree.inOderTraversal(root);
    }

}
